Regularized non-negative matrix factorization using alternating direction method of multipliers and its application to source separation
نویسندگان
چکیده
Non-negative matrix factorization (NMF) aims at finding nonnegative representations of nonnegative data. Among different NMF algorithms, alternating direction method of multipliers (ADMM) is a popular one with superior performance. However, we find that ADMM shows instability and inferior performance on real-world data like speech signals. In this paper, to solve this problem, we develop a class of advanced regularized ADMM algorithms for NMF. Efficient and robust learning rules are achieved by incorporating l1-norm and the Frobenius norm regularization. The prior information of Laplacian distribution of data is used to solve the problem with a unique solution. We evaluate this class of ADMM algorithms using both synthetic and real speech signals for a source separation task at different cost functions, i.e., Euclidean distance (EUD), KullbackLeibler (KL) divergence and Itakura-Saito (IS) divergence. Results demonstrate that the proposed algorithms converge faster and yield more stable and accurate results than the original ADMM algorithm.
منابع مشابه
Nonnegative matrix factorization with quadratic programming
Nonnegative Matrix Factorization (NMF) solves the following problem: find such nonnegative matrices A ∈ RI×J + and X ∈ RJ×K + that Y ∼= AX, given only Y ∈ RI×K and the assigned index J (K >> I ≥ J). Basically, the factorization is achieved by alternating minimization of a given cost function subject to nonnegativity constraints. In the paper, we propose to use Quadratic Programming (QP) to solv...
متن کاملRegularized Alternating Least Squares Algorithms for Non-negative Matrix/Tensor Factorization
Nonnegative Matrix and Tensor Factorization (NMF/NTF) and Sparse Component Analysis (SCA) have already found many potential applications, especially in multi-way Blind Source Separation (BSS), multi-dimensional data analysis, model reduction and sparse signal/image representations. In this paper we propose a family of the modified Regularized Alternating Least Squares (RALS) algorithms for NMF/...
متن کاملA Projected Alternating Least square Approach for Computation of Nonnegative Matrix Factorization
Nonnegative matrix factorization (NMF) is a common method in data mining that have been used in different applications as a dimension reduction, classification or clustering method. Methods in alternating least square (ALS) approach usually used to solve this non-convex minimization problem. At each step of ALS algorithms two convex least square problems should be solved, which causes high com...
متن کاملBlock-Simultaneous Direction Method of Multipliers: A proximal primal-dual splitting algorithm for nonconvex problems with multiple constraints
We introduce a generalization of the linearized Alternating Direction Method of Multipliers to optimize a real-valued function f of multiple arguments with potentially multiple constraints g◦ on each of them. The function f may be nonconvex as long as it is convex in every argument, while the constraints g◦ need to be convex but not smooth. If f is smooth, the proposed Block-Simultaneous Direct...
متن کاملRegularized Non-Negative Matrix Factorization for Dynamic and Relational Data
Data involving repeated measurements of several variables over different factors, experimental conditions or time may exhibit correlations among variables, as well as between factors. The discovery of these underlying, meaningful relations is important to a wide variety of areas such as psychology, signal processing, finance, among others. Common methods such as independent component analysis, ...
متن کامل